Probability Density Estimation Using Entropy Maximization

نویسندگان

  • Gad Miller
  • David Horn
چکیده

We propose a method for estimating probability density functions and conditional density functions by training on data produced by such distributions. The algorithm employs new stochastic variables that amount to coding of the input, using a principle of entropy maximization. It is shown to be closely related to the maximum likelihood approach. The encoding step of the algorithm provides an estimate of the probability distribution. The decoding step serves as a generative mode, producing an ensemble of data with the desired distribution. The algorithm is readily implemented by neural networks, using stochastic gradient ascent to achieve entropy maximization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximum within-cluster association

This paper addresses a new method and aspect of information-theoretic clustering where we exploits the minimum entropy principle and the quadratic distance measure between probability densities. We present a new minimum entropy objective function which leads to the maximization of within-cluster association. A simple implementation using the gradient ascent method is given. In addition, we show...

متن کامل

Local adaptive algorithms for information maximization in neural networks, and application to source separation

Information theoretic criteria for neural network adaptation laws have recently become an important focus of attention. We consider the problem of adaptively maximizing the entropy of the outputs of a deterministic feedforward neural network with real valued stochastic input signals, as considered by Bell and Sejnowski. We give a new explanation for the relevance of output information (entropy)...

متن کامل

Blind Equalization Using Direct Channel Estimation

In performing blind equalization, we propose a direct channel estimation method based on entropy-maximization of input signal with its known probability density function. That is, the proposed method estimates filter coefficients of the channel instead of equalizing filter coefficients which most of equalization methods try to estimate. Because the channel usually has a much shorter length than...

متن کامل

Sensor management using an active sensing approach

An approach that is common in the machine learning literature, known as active sensing, is applied to provide a method for managing agile sensors in a dynamic environment. We adopt an active sensing approach to scheduling sensors for multiple target tracking applications that combines particle filtering, predictive density estimation, and relative entropy maximization. Specifically, the goal of...

متن کامل

Probability Density Estimation Using Advanced Support Vector Machines and the Expectation Maximization Algorithm

This paper presents a new approach for the probability density function estimation using the Support Vector Machines (SVM) and the Expectation Maximization (EM) algorithms. In the proposed approach, an advanced algorithm for the SVM density estimation which incorporates the Mean Field theory in the learning process is used. Instead of using ad-hoc values for the parameters of the kernel functio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Neural computation

دوره 10 7  شماره 

صفحات  -

تاریخ انتشار 1998